Structural Completeness in Fuzzy Logics

Structural Completeness in Relevance Logics

Structural completeness in propositional logics of dependence

In this paper we prove that three of the main propositional logics of dependence are structurally complete with respect to a class of substitutions under which the logics are closed. As these logics are not structural, the notions of admissibility and structural completeness have to be considered relative to classes of substitutions with respect to which they are, as we do in this paper. Depend...

Strong non-standard completeness for fuzzy logics

In this paper we are going to introduce the notion of strong non-standard completeness (SNSC) for fuzzy logics. This notion naturally arises from the well known construction by ultraproduct. Roughly speaking, to say that a logic C is strong non-standard complete means that, for any countable theory Γ over C and any formula φ such that Γ 6`C φ, there exists an evaluation e of C-formulas into a C...

A New Proof of Structural Completeness of Lukasiewicz’s Logics

A Syntactical Characterization of Structural Completeness for Implicational Logics